منابع مشابه
Some theoretical open problems in data mining
This document contains a selection of open problems provided by participants of the data mining PhD reading seminar at the IT University of Copenhagen in fall 2009. It is not intended to showcase the “most significant” open problems in the field, but merely problems found interesting by the participants. In particular, the theoretical angle of the seminar is reflected. 1 Frequent itemsets — a r...
متن کاملGraph-Theoretical Models for Frequency Assignment Problems
In the present dissertation we investigate structural and algorithmic aspects of the frequency assignment problem in mobile telephone networks. This problem is of particular interest for the graph theory because of its close relationship to graph coloring. The frequency assignment problem includes the characteristic features of T-coloring, list coloring, and set coloring, and belongs thereby to...
متن کاملProblems in Theoretical Stochastic Category Theory
Let us suppose we are given an isometric hull φ. Recent interest in lines has centered on constructing linear, Poncelet, trivial systems. We show that Ψπ is naturally onto. Every student is aware that every stochastically bijective, Atiyah–Eudoxus vector is almost nonnegative. In contrast, we wish to extend the results of [3] to almost everywhere negative isomorphisms.
متن کاملAlgorithms for some graph theoretical optimization problems
This thesis is situated in the field of combinatorial optimization. More specifically, we focus on solution methods for solving a number of graphtheoretical optimization problems. First we give a short introduction to the field of integer programming and state of the art solution techniques. The remainder of this thesis can be roughly split into two parts. The first part is dedicated to the pro...
متن کاملSet-theoretical Properties of Extreme Combinatorial Problems
Concepts of constructive combinatorial problem and, in particular, of extreme combinatorial problem (ECP) are deened. It is announced a sequential principle of construction of the constructive combinatorial problems' solution. This principle leads to necessity to consider ECP as system of independence with weighted elements. Auxiliary sets, which are connected to the solution of optimization pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symposium - International Astronomical Union
سال: 1983
ISSN: 0074-1809
DOI: 10.1017/s0074180900030229